Optimistic and Topological Value Iteration for Simple Stochastic Games
نویسندگان
چکیده
While value iteration (VI) is a standard solution approach to simple stochastic games (SSGs), it suffered from the lack of stopping criterion. Recently, several solutions have appeared, among them also “optimistic” VI (OVI). However, OVI applicable only one-player SSGs with no end components. We lift these two assumptions, making available general SSGs. Further, we utilize idea in context topological VI, where provide an efficient precise solution. In order compare new algorithms state art, use not benchmarks, but design random generator SSGs, which can be biased towards various types models, aiding understanding advantages different on
منابع مشابه
Relative Value Iteration for Stochastic Differential Games
Abstract. We study zero-sum stochastic differential games with player dynamics governed by a nondegenerate controlled diffusion process. Under the assumption of uniform stability, we establish the existence of a solution to the Isaac’s equation for the ergodic game and characterize the optimal stationary strategies. The data is not assumed to be bounded, nor do we assume geometric ergodicity. T...
متن کاملFocused Topological Value Iteration
Topological value iteration (TVI) is an effective algorithm for solving Markov decision processes (MDPs) optimally, which 1) divides an MDP into strongly-connected components, and 2) solves these components sequentially. Yet, TVI’s usefulness tends to degrade if an MDP has large components, because the cost of the division process isn’t offset by gains during solution. This paper presents a new...
متن کاملTopological Value Iteration Algorithms
Value iteration is a powerful yet inefficient algorithm for Markov decision processes (MDPs) because it puts the majority of its effort into backing up the entire state space, which turns out to be unnecessary in many cases. In order to overcome this problem, many approaches have been proposed. Among them, ILAO* and variants of RTDP are state-of-the-art ones. These methods use reachability anal...
متن کاملSolving Simple Stochastic Games
We present a new algorithm for solving Simple Stochastic Games (SSGs), which is fixed parameter tractable when parametrized with the number of random vertices. This algorithm is based on an exhaustive search of a special kind of positional optimal strategies, the f-strategies. The running time is O( |VR|! · (log(|V |)|E| + |p|) ), where |V |, |VR|, |E| and |p| are respectively the number of ver...
متن کاملHow to Win Some Simple Iteration Games
We introduce two new iteration games: the game G, which is a strengthening of the weak iteration game, and the game G, which is somewhat stronger than G but weaker than the full iteration game of length ω1. For a countable M elementarily embeddable in some Vη, we can show that II wins G(M,ω1) and that I does not win the G (M).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-19992-9_18